A numerically scalable domain decomposition method for the solution of frictionless contact problems
نویسندگان
چکیده
We present a domain decomposition method with Lagrange multipliers for solving iteratively frictionless contact problems. This method, which is based on the FETI method and therefore is named here the FETIC method, incorporates a coarse contact system that guides the iterative prediction of the active zone of contact. We demonstrate numerically that this method is numerically scalable with respect to both the problem size and the number of subdomains. This article in its final form was published in International Journal for Numerical Methods in Engineering, Volume 50, Issue 12, 2001, Pages 2643-2666. Wiley doi:10.1002/nme.140 keyword contact; domain decomposition; FETI; scalability
منابع مشابه
The FETI family of domain decomposition methods for inequality-constrained quadratic programming: Application to contact problems with conforming and nonconforming interfaces
Two domain decomposition methods with Lagrange multipliers for solving iteratively quadratic programming problems with inequality constraints are presented. These methods are based on the FETI and FETI-DP substructuring algorithms. In the case of linear constraints, they do not perform any Newton-like iteration. Instead, they solve a constrained problem by an active set strategy and a generaliz...
متن کاملNumerically and parallel scalable TFETI algorithms for quasistatic contact
This paper deals with the solution of the discretized quasistatic 3D Signorini problems with local Coulomb friction. After a time discretization we obtain a system of static contact problems with Coulomb friction. Each of these problems is decomposed by the TFETI domain decomposition method used in auxiliary contact problemswith Tresca friction. The algebraic formulation of these problems in 3D...
متن کاملScalable Total BETI based solver for 3D multibody frictionless contact problems in mechanical engineering
A Total BETI (TBETI) based domain decomposition algorithm with the preconditioning by a natural coarse grid of the rigid body motions is adapted for the solution of multibody frictionless contact problems of linear elastostatics and proved to be scalable, i.e., the cost of the solution is asymptotically proportional to the number of variables. The analysis admits floating bodies. The proofs com...
متن کاملA Posteriori Error Estimates for a Neumann-neumann Domain Decomposition Algorithm Applied to Contact Problems
Contact problems are frequent in structural analysis. They are characterized by inequality constraints such as non-interpenetration conditions, sign condition on the normal constraints, and an active contact, an area that is a priori unknown. Several approaches exist for solving the non linear equations issued from the finite element discretization of frictionless contact problems. In this work...
متن کاملOptimization algorithms for the solution of the frictionless normal contact between rough surfaces
This paper revisits the fundamental equations for the solution of the frictionless unilateral normal contact problem between a rough rigid surface and a linear elastic half-plane using the boundary element method (BEM). After recasting the resulting Linear Complementarity Problem (LCP) as a convex quadratic program (QP) with nonnegative constraints, different optimization algorithms are compare...
متن کامل